Population extremal optimisation for discrete multi-objective optimisation problems

Applying Extremal Optimisation To Dynamic Optimisation Problems

Evolutionary Population Dynamics and Multi-Objective Optimisation Problems

Problems for which many objective functions are to be simultaneously optimised are widely encountered in science and industry. These multiobjective problems have also been the subject of intensive investigation and development recently for metaheuristic search algorithms such as ant colony optimisation, particle swarm optimisation and extremal optimisation. In this chapter, a unifying framework...

Local Search Enabled Extremal Optimisation for Continuous Inseparable Multi-objective Benchmark and Real-world Problems

Local search is an integral part of many meta-heuristic strategies that solve single objective optimisation problems. Essentially, the meta-heuristic is responsible for generating a good starting point from which a greedy local search will find the local optimum. Indeed, the best known solutions to many hard problems (such as the travelling salesman problem) have been generated in this hybrid w...

Multi-objective Binary Search Optimisation

Full Elite Sets for Multi-objective Optimisation

Multi-objective evolutionary algorithms frequently use an archive of non-dominated solutions to approximate the Pareto front. We show that the truncation of this archive to a limited number of solutions can lead to oscillating and shrinking estimates of the Pareto front. New data structures to permit efficient query and update of the full archive are proposed, and the superior quality of fronta...